Surface Projective Convexe de volume fini
نویسندگان
چکیده
منابع مشابه
Construction Géométrique De Représentations De Weil Sur Un Corps Fini
We construct, by contraction of a suitable complex vector bundle, the Weil representation of the finite symplectic group Sp(A). We give an explicit description of the space of all lagrangian subspaces, which we use to compute the cocycle of our representation in terms of a geometric Gauss sum. We recover in this way previously constructed generalized Weil representations (see [2, 3]) by restric...
متن کاملRecherche locale de politique dans un espace convexe
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملOptimisation convexe pour l’estimation simultanée de réponses acoustiques
We consider the estimation of acoustic impulse responses from the simultaneous recording of several known sources. Existing techniques are restricted to the case where the number of sources is at most equal to the number of sensors. We relax this assumption in the case where the sources are known. To this aim, we propose statistical models of the filters associated with a convex log-likelihood,...
متن کاملUne procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
In this paper, we deal with the satisfiability problem for Systems of constraints over hereditarily finite sets This problem is central for integrating sets in programming languages, and particularly for constraint logic programming languages The approach we propose hère is based on reducing Systems of set constraints into Systems ofhnear integer equalities and inequahties (with bounded domain)...
متن کاملGeometric and Combinatorial Aspects of Convex Optimization Aspects géométriques et combinatoires de l’optimisation convexe (Org:
A fundamental domain of geometric object X is a minimal subset D such that the object can be covered by isomorphs of D under the natural symmetry group of X. For a convex polyhedral cone we have the property that every orbit of extreme rays has exactly one representative in a given fundamental domain. In this talk I will present some ideas and preliminary experiments for computing orbits of ext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 2012
ISSN: 0373-0956,1777-5310
DOI: 10.5802/aif.2707